On truncation of irreducible representations of Chevalley groups
نویسندگان
چکیده
منابع مشابه
Computing Irreducible Representations of Groups
How can you find a complete set of inequivalent irreducible (ordinary) representations of a finite group? The theory is classical but, except when the group was very small or had a rather special structure, the actual computations were prohibitive before the advent of high-speed computers ; and there remain practical difficulties even for groups of relatively small orders ( á 100). The present ...
متن کاملIrreducible Representations of Diperiodic Groups
The irreducible representations of all of the 80 diperiodic groups, being the symmetries of the systems translationally periodical in two directions, are calculated. To this end, each of these groups is factorized as the product of a generalized translational group and an axial point group. The results are presented in the form of the tables, containing the matrices of the irreducible represent...
متن کاملComputing Irreducible Representations of Finite Groups
We consider the bit-complexity of the problem stated in the title. Exact computations in algebraic number fields are performed symbolically. We present a polynomial-time algorithm to find a complete set of nonequivalent irreducible representations over the field of complex numbers of a finite group given by its multiplication table. In particular, it follows that some representative of each equ...
متن کاملIrreducible Representations of Finite Spin Groups
In this paper we present a computation (done by the author in 1983) which yields a multiplicity one statement for the irreducible representations of a finite spin group which, in turn, yields the classification of the irreducible representations of a finite spin group. Introduction 0.1. Let G be a connected reductive group defined over a finite field Fq and let F : G → G be the corresponding Fr...
متن کاملComputing Irreducible Representations of Supersolvable Groups
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2013
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2013.03.014